Research on Refining the Distributed Supply Chain Procurement Plans Based on CRL.

Dynamic Routing Selection for Wireless Sensor Networks.
Abstract—The allocation of computation and communication resources in a manner that optimizes aggregate system performance is a crucial aspect of system management. Wireless sensor network poses new challenges due to the resource constraints and real-time requirements. Existing work has dealt with the realtime sampling rate assignment problem, under single processor case and network case with static routing environment. For wireless sensor networks, in order to achieve better overall network performance, routing should be considered together with the rate assignments of individual flows. In this paper, we address the problem of optimizing sampling rates with dynamic route selection for wireless sensor networks. We model the problem as a constrained optimization problem and solve it under the Network Utility Maximization framework. Based on the primal-dual method and dual decomposition technique, we
Meta%2Dheuristic Enabled MAS Optimization in Supply Chain Procurement.

A New Model of Mine Hoist Fault Diagnosis Based on the Rough Set Theory.

A Multi%2DFocus Image Fusion Algorithm with DT%2DCWT.

A Multi%2DFocus Image Fusion Algorithm with DT%2DCWT.

Persistence of some stage structured ecosystems with finite and infinite delay.

Permanence of variable coefficients predator%2Dprey system with stage structure.

Global stability and asymptotically periodic solution for nonautonomous cooperative Lotka%2DVolterra diffusion system.

Dynamic Task%2DBased Anycasting in Mobile Ad Hoc Network.
Mobile ad hoc networks (MANETs) have received significant attention in the recent past owing to the proliferation in the numbers of tetherless portable devices, and rapid growth in popularity of wireless networking. Most of the MANET research community has remained focused on developing lower layer mechanisms such as channel access and routing for making MANETs operational. However, little focus has been applied on higher layer issues, especially application modeling. In this paper, we present a novel distributed application framework based on task graphs that enables a large class of resource discovery based applications on MANETs. A distributed application is represented as a complex task comprised of smaller sub-tasks that need to be performed on different classes of computing devices with specialized roles. Execution of a particular task on a MANET involves several logical patterns of data flow between classes of such specialized devices. These data flow patterns induce dependencies between the different classes of devices that need to cooperate to execute the application. Such dependencies yield a task graph representation of the application. We focus on the problem of executing distributed tasks on a MANET by means of dynamic selection of specific devices that are needed to complete the tasks. In this paper,
A new task%2Dbased approach for supporting distributed applications on mobile ad hoc networks.
Mobile ad hoc networks (MANETs) have received significant attention recently owing to the increasing popularity of tetherless computing and the rapid growth of wireless networking technology. In this paper, we present a novel application framework for dynamic execution of distributed tasks on potentially mobile devices which form a MANET. In this framework, logical patterns of interaction between simpler components of a distributed application are exploited for the discovery of suitable devices/resources on which the application is actually executed. Our application framework is adaptive to network partitions caused by mobility of devices as it enables users to obtain a required service from several devices (providing the same service) over the lifetime of an application. This work helps enable new applications in diverse areas such as smart offices/homes, sensor networks, distributed computing, and
